Max-Min Fairness in 802.11 Mesh Networks
نویسندگان
چکیده
منابع مشابه
Unifying View on Min-Max Fairness, Max-Min Fairness, and Utility Optimization in Cellular Networks
We are concerned with the control of quality of service (QoS) in wireless cellular networks utilizing linear receivers. We investigate the issues of fairness and total performance, which are measured by a utility function in the form of a weighted sum of link QoS. We disprove the common conjecture on incompatibility of min-max fairness and utility optimality by characterizing network classes in...
متن کاملRound-Robin Scheduling for Max-Min Fairness in Data Networks
This paper studies a simple strategy, proposed independently by Gallager [1] and Katevenis [2], for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round-robin order. In addition, window flow control is used to prevent excessive packet queues at the network nod...
متن کاملMax-Min Fairness in Input-Queued Switches
This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.
متن کاملOn max-min fair flow optimization in wireless mesh networks
The paper is devoted to modeling wireless mesh networks (WMN) through mixed-integer programming (MIP) formulations that allow to precisely characterize the link data rate capacity and transmission scheduling using the notion of time slots. Such MIP models are formulated for several cases of the modulation and coding schemes (MCS) assignment. We present a general way of solving the max-min fairn...
متن کاملOn the optimality of max-min fairness in resource allocation
In this work a basic Resource Allocation (RA) problem is considered, where a fixed capacity must be shared among a set of users. The RA task can be formulated as an optimization problem, with a set of simple constraints and an objective function to be minimized. A fundamental relation between the RA optimization problem and the notion of max-min fairness is established. A sufficient condition o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2012
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2011.2165850